LTL Model Checking under Fairness in ProB
نویسندگان
چکیده
Model checking of liveness properties often results in unrealistic, unfair infinite behaviors as counterexamples. Fairness is a notion where the search is constrained to infinite paths that do not ignore infinitely the execution of a set of enabled actions. In this work we present an implementation for efficient checking of LTL formulas under strong and weak fairness in ProB, available for model checking B, Event-B, Z, CSP and CSP‖B models. The fairness checking algorithm can cope with both weak and strong fairness conditions, where the respective fairness conditions can be joined by means of the logical operators for conjunction and disjunction, which makes setting up and checking fairness to a property more flexible. We evaluate the implementation on various CSP models and compare it to the fairness implementation of the PAT tool.
منابع مشابه
State/Event-Based LTL Model Checking under Parametric Generalized Fairness
In modeling a concurrent system, fairness constraints are usually considered at a specific granularity level of the system, leading to many different variants of fairness: transition fairness, object/process fairness, actor fairness, etc. These different notions of fairness can be unified by making explicit their parametrization over the relevant entities in the system as universal quantificati...
متن کاملModel Checking LTL with Fairness Assumptions using Net Unfoldings
We investigate the model checking problem for a class of petri nets using net unfoldings. Net unfoldings are a well studied partial order semantics for petri nets and are well-suited for modeling concurrent and distributed systems. We consider the problem of model checking LTL-X (LTL without the next time operator) with fairness assumptions for the class of one-safe petri nets. Recently, in [1]...
متن کاملAnother Look at LTL Model Checking
We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite eecient in practice. In particular, we show how the SMV model checking system developed by McMillan 16] can be extended to permit LTL spec-iications. The results that we have obtained are quit...
متن کاملDirect Model Checking of Temporal
In this paper, we address the problem of model checking temporal properties of nite-state programs. This problem is usually solved by modelling the program as well as the negation of the desired temporal property as automata on innnite words (B uchi automata) and checking for emptiness of the automaton resulting from the synchronous product of the program automaton and the negated property auto...
متن کامل\Direct" Model Checking of Temporal Properties
In this paper, we address the problem of model checking temporal properties of nite-state programs. This problem is usually solved by modelling the program as well as the negation of the desired temporal property as automata on in nite words (B uchi automata) and checking for emptiness of the automaton resulting from the synchronous product of the program automaton and the negated property aut...
متن کامل